Algorithms for Testing and Embedding Planar Graphs
نویسنده
چکیده
2 Embedding graphs into planarity 3 2.1 embedding algorithms donot use PQ-trees . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.1.1 A planarity embedding algorithm based on the Kuratowski theorem . . . . . . . . 3 2.1.2 An embedding algorithm based on open ear decomposition . . . . . . . . . . . . . . 3 2.1.3 A simplified o (n) planar embedding algorithm for biconnected graphs . . . . . . . 4 2.1.4 Lempel,Even,and Cederbaum planarity method . . . . . . . . . . . . . . . . . . . . 5 2.2 Embedding algorithms using PQ-trees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2.1 Embedding planar graphs using PQ-tree algorithms . . . . . . . . . . . . . . . . . . 6 2.2.2 An algorithm is on the basis of vertex addition for planarity testing and uses PQtrees to embed graphs into planarites . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2.3 An algorithm modifies PQ-trees to embed graphs into planarities . . . . . . . . . . 7
منابع مشابه
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
Let C be a clustered graph and suppose that the planar embedding of its underlying graph is fixed. Is testing the c-planarity of C easier than in the variable embedding setting? In this paper we give a first contribution towards answering the above question. Namely, we characterize c-planar embedded flat clustered graphs with at most five vertices per face and give an efficient testing algorith...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملTwo-page Book Embedding and Clustered Graph Planarity
A 2-page book embedding of a graph places the vertices linearly on a spine (a line segment) and the edges on two pages (two half planes sharing the spine) so that each edge is embedded in one of the pages without edge crossings. Testing whether a given graph admits a 2-page book embedding is known to be NP-complete. In this paper, we study the problem of testing whether a given graph admits a 2...
متن کاملPlanarity Testing and Embedding
Universita’ di Roma Tre 3.1 Properties and Characterizations of Planar Graphs . . . . . 2 Basic Definitions • Properties • Characterizations 3.2 Planarity Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.3 History of Planarity Algorithms. . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.4 Common Algorithmic Techniques and Tools . . . . . ...
متن کاملPlanarity Testing for C-Connected Clustered Graphs
We present a linear time algorithm for testing clustered planarity of c-connected clustered graphs and for computing a clustered planar embedding for such graphs. Our algorithm uses a decomposition of the input graph based on SPQR-trees and is the first linear time algorithm for clustered planarity testing. We define a normal form of clustered embeddings and show that a clustered graph is clust...
متن کامل